职业技能鉴定质量分析初探

职业技能鉴定是推行职业资格证书制度的重要环节,鉴定的质量直接关系到职业资格证书的真实性、权威性。通过对试卷的有效性和可靠性的分析,以及对试题难度、区分度的分析,对职业技能鉴定质量的分析方法进行了探讨,阐述了质量分析在职业技能鉴定中的作用。     

中厚板轧制边部不均匀变形机理的探讨

通过分析宽中厚板轧制过程中的边部不均匀变形，探讨了其影响因素及大宽度板“切边纵裂”的产生原因，提出了解决问题的具体办法。     

���������ز��׹��ƻ�������Ԫ����

文中建立了套管、水泥环和地层互作用的弹塑性的有限元力学模型，用MSC.Marc软件的高度非线性功能对本文的复杂力学系统进行了一系列的计算机仿真模拟研究，为复杂地层套管破坏机理研究提供了简便，可行的方法。本方法可以反推地层载荷，为复杂地层套管破坏的预防措施提供了理论依据。     

蒸发器泄漏原因分析及处理

对锦州石化分公司第三套催化裂化装置系统蒸发器泄漏原因进行了分析,并提出处理措施。收到较好的效果。     

江西省2005年暴雨洪水特性及水文测报工作

对江西省2005年暴雨洪水特性进行了分析,并对防汛水文测报工作和水文防御山洪地质灾害的经验做了总结.     

椭圆型偏微分方程的加法Schwarz方法

1.引 言 古典加法Schwarz方法(ASM)对于一般问题收敛很慢,在大多数情况下, ASM只能作为预条件子.另一方面,ASM的并行性能非常好,尤其适合大规模粗粒度并行计算,近年来随着并行机系统及并行计算的兴起,ASM重新受到重视.许多学者研究了怎样提高ASM的收敛速度[1,2,4].他们发现加法Schwarz方法之所以收敛慢是由于在内边界上采用     

Protein binding study of isoflavone, perillyl alcohol and S-ibuprofen by high-performance frontal analysis

High-performance frontal analysis (HPFA) was used for a protein binding study of isoflavones (daidzein, genistin, and genistein), enantiomers of perillyl alcohol and S-ibuprofen to human serum albumin (HSA). The analyses were performed on a Develosil and Inertsil 100-Diol-5 column (10 cm×4.6mm). Sodium phosphate solution (pH 7.4, ionic strength 0.17) was used as the mobile phase at a flow rate of 1 ml/min. To ensure the drug to be eluted as a trapezoidal peak with a plateau, injection volumes were each fixed up the zonal profile with an evident plateau appears. The unbound drug concentration was determined from a plateau height of the plateau region after that experimental data were fitted by Scatchard equation. The binding constants (K) and total binding affinities (nK) of drugs to HSA were calculated, respectively.     

冰蓄冷系统运行经济性分析

建筑物的空调制冷系统采用蓄冷方式，可以节约运行费用，减少设备容量，转移用电高峰。蓄冷空调系统与常规空调系统相比，在运行的经济性方面有很多优点。因此开发了冰蓄冷系统运行经济性分析计算机软件，应用这套软件对实际工程项目进行分析，计算出各种冰蓄冷系统与相应常规系统的逐时耗电量、电费、全年运行费用和设备容量减少率等，并以图表的方式对两种系统的经济性作出综合的比较，能全面、直观的显示冰蓄冷系统的优点。     

Cycle detection using a stack

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.     

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.